Corrigendum for Arithmetic Complexity, Kleene Closure, and Formal Power Series

نویسندگان

  • Eric Allender
  • V Arvind
  • Meena Mahajan
  • Pierre McKenzie
  • Sambuddha Roy
چکیده

Pierre McKenzie and Sambuddha Roy pointed out that the proof of statements (b) and (c) in Theorem 7.3 are buggy. The main flaw is that the identity e of the group F may not be the identity of the monoid, and so the claim that w ∈ (A F,r) * ⇐⇒ w ∈ Test does not work. In this corrigendum, we show: • With a slight change to Definition 7.1, the statement of Theorem 7.3 holds unchanged. In our opinion, this is the most interesting way to correct the error in the original paper. We present a complete proof below. For completeness, we also mention another way to correct the error: • Leaving Definition 7.1 unchanged, a weaker version of Theorem 7.3 holds (with only minor adjustments to the proof given in the paper). First, we present the modified version of Theorem 7.3 that holds using the original version of Definition 7.1 Theorem 7.3 (Variant) (a) Let A be any finite nonsolvable monoid. Then there exists a group F ⊆ A and a constant r > 0 such that the (A F,r) * closure problem is NC 1-complete. (b) Let A be any finite monoid, and let F be a group contained in A, with the same identity e as the monoid identity. Then the (A F,r) * closure problem is reducible via AC 0-Turing reductions to the word problem over the finite monoid A. (c) If A is a finite solvable monoid and F is a group in it with the same identity as A, then the (A F,r) * closure problem is in ACC 0. Furthermore, if A is an aperiodic monoid then the (A F,r) * closure problem is in AC 0. We now proceed to give a modification to Definition 7.1, with the property that that both Corollary 7.2 and Theorem 7.3 are true, as stated in the original paper. Definition 7.4 (Modified from Definition 7.1 in the paper) Let A be a finite monoid. There is a natural homomorphism v : A * → A that maps a word w to its valuation v(w) in the monoid A. Let F be a group contained in A, let e denote the identity of F , and let r be a positive integer. The language A F,r ⊆ A * is defined as A F,r = {w ∈ A * | |w| ≤ r, v(ew) ∈ F …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Complexity, Kleene Closure, and Formal Power Series

The aim of this paper is to use formal power series techniques to study the structure of small arithmetic complexity classes such as GapNC and GapL. More precisely, we apply the Kleene closure of languages and the formal power series operations of inversion and root extraction to these complexity classes. We define a counting version of Kleene closure and show that it is intimately related to i...

متن کامل

SASE+: An Agile Language for Kleene Closure over Event Streams

In this paper, we present SASE+, a complex event language that supports Kleene closure over event streams, and provide a formal analysis of the expressibility of this language. Complex event patterns involving Kleene closure are finding application in a growing number of stream applications including financial services, RFIDbased inventory management, monitoring in healthcare, etc. While Kleene...

متن کامل

Kleene Theorems for skew formal power series

We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem prov...

متن کامل

On skew formal power series

We investigate the theory of skew (formal) power series introduced by Droste, Kuske [4, 5], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem prov...

متن کامل

From Closure Games to Strong Kleene Truth

In this paper, we study the method of closure games, a gametheoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3and 4-valued Strong Kleene fixed points in a novel and informative manner. Amongst others, we also present closure games which induce the minimal an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011